Bioconditional cordial labeling of ladder graph and K2 + nK1 graph
By: Murali, B. J
.
Contributor(s): Thirusangu, K.
Publisher: Haryana International Science Press 2021Edition: Vol.11(1), Jan-June.Description: 47-55p.Subject(s): Computer EngineeringOnline resources: Click here
In:
International journal of embedded software and open source systemsSummary: Graph labeling in graph theory, an interesting part of mathematics, is a functional assignment of labels to the vertices or edges or both subGrapject to certain mathematical conditions. The labels may be integers or elements of any algebraic structure. The study of graph labeling is focusing on classification of graphs which admit a particular kind of labeling. The labeled graphs are useful in broad range of applications....
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Articles Abstract Database
|
School of Engineering & Technology Archieval Section | Not for loan | 2022-0105 |
Total holds: 0
Graph labeling in graph theory, an interesting part of mathematics, is a functional assignment of labels to the vertices or edges or both subGrapject to certain mathematical conditions. The labels may be integers or elements of any algebraic structure. The study of graph labeling is focusing on classification of graphs which admit a particular kind of labeling. The labeled graphs are useful in broad range of applications....
Click on an image to view it in the image viewer
There are no comments for this item.